On accessibility of groups
نویسندگان
چکیده
منابع مشابه
Acylindrical accessibility for groups acting on R-trees
We prove an acylindrical accessibility theorem for finitely generated groups acting on R-trees. Namely, we show that if G is a freely indecomposable non-cyclic k-generated group acting minimally and M-acylindrically on an R-tree X then for any ǫ > 0 there is a finite subtree Yǫ ⊆ X of measure at most 2M (k − 1) + ǫ such that GYǫ = X. This generalizes theorems of Z.Sela and T.Delzant about actio...
متن کاملStereochemistry and accessibility of prosthetic groups in flavoproteins.
Using 8-demethyl-8-hydroxy-5-deaza-5-carba analogues of the appropriate flavin nucleotides, we determined the stereochemistry of interaction between coenzyme and substrate for several flavoproteins. The enzymes were D-amino acid oxidase, L-lactate oxidase, and D-lactate dehydrogenase, all three of which interact with pyruvate, as well as cyclohexanone monooxygenase and 2-methyl-3-hydroxypyridin...
متن کاملOn fibers and accessibility of groups acting on trees with inversions
Throughout this paper the actions of groups on graphs with inversions are allowed. An element g of a group G is called inverter if there exists a tree X where G acts such that g transfers an edge of X into its inverse. A group G is called accessible if G is finitely generated and there exists a tree on which G acts such that each edge group is finite, no vertex is stabilized by G, and each vert...
متن کاملStrong Accessibility of Coxeter Groups over Minimal Splittings
Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence Λ1, Λ2, . . . , Λn of graph of groups decompositions of G with edge groups in C such that Λ1 is the trivial decomposition (with 1-vertex) and for i > 1, Λi is obtained from Λi−1 by non-trivially and compatibly splitting a vertex group of Λi−1 over a group in C, replacing t...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1983
ISSN: 0022-4049
DOI: 10.1016/0022-4049(83)90037-3